DRω/πF : A Fault Tolerant Distributed Routing Calculi

نویسندگان

  • Manish Gaur
  • Rama Kant
چکیده

We design a new language DRπ F in which we extend the language DRπ to handle node failure during communication. We have extended the reduction semantics of DRπ . For handling the node failure we describe two tables at router: One is routing table contains name mapping for forward travel of messages and other is a database of all active nodes at any router. Further we discuss the new node creation and failed node activation during communication. We show how the entries of routing tables are updated using backward learning updates. We explain the usefulness and working of our reduction semantics by taking one example. General Terms Pi Calculus, Formal Methods, Routing

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

CAFT: Cost-aware and Fault-tolerant routing algorithm in 2D mesh Network-on-Chip

By increasing, the complexity of chips and the need to integrating more components into a chip has made network –on- chip known as an important infrastructure for network communications on the system, and is a good alternative to traditional ways and using the bus. By increasing the density of chips, the possibility of failure in the chip network increases and providing correction and fault tol...

متن کامل

Fault-tolerant Wormhole Routing using a Variation of Distributed Recovery Block Approach

This paper describes a fault-tolerant wormhole routing technique that incorporates a variation of distributed recovery block (DRB) approach. The section of a parallel system that spans between the source and destination nodes is dynamically partitioned into overlapping DRB groups. A DRB group consists of a current node, a primary and an alternate successor node. The message packets travel towar...

متن کامل

Fault Tolerant Routing in Mesh Topologies

Fault tolerant routing refers to transfer of messages from a source to destination in a network with faulty links and/or nodes. Fault tolerant routing is one of the key problems in designing robust distributed algorithms. Internet routing protocols like BCG are also examples of adaptive routing algorithms. Adaptive routing in distributed systems can be desirable at either the application level ...

متن کامل

Reliability and Performance Evaluation of Fault-aware Routing Methods for Network-on-Chip Architectures (RESEARCH NOTE)

Nowadays, faults and failures are increasing especially in complex systems such as Network-on-Chip (NoC) based Systems-on-a-Chip due to the increasing susceptibility and decreasing feature sizes. On the other hand, fault-tolerant routing algorithms have an evident effect on tolerating permanent faults and improving the reliability of a Network-on-Chip based system. This paper presents reliabili...

متن کامل

A Limited-Global Fault Information Model for Dynamic Routing in -D Meshes

In this paper, a fault-tolerant routing in -D meshes with dynamic faults is provided. It is based on an early work on fault-tolerant routing in dynamic 2-D meshes [9] and 3-D meshes [10] where faults occur during a routing process. Unlike many traditional models that assume all the nodes know global fault information, our approach is based on the concept of limited global fault information. Fir...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012